Parallelization of the Wolff single-cluster algorithm
نویسندگان
چکیده
منابع مشابه
Parallelization of the Wolff single-cluster algorithm.
A parallel [open multiprocessing (OpenMP)] implementation of the Wolff single-cluster algorithm has been developed and tested for the three-dimensional (3D) Ising model. The developed procedure is generalizable to other lattice spin models and its effectiveness depends on the specific application at hand. The applicability of the developed methodology is discussed in the context of the applicat...
متن کاملSingle-walk Parallelization of the Genetic Algorithm
Abstract: This paper aims at presenting theoretical properties which can be used to approximate the theoretical speedup of parallel genetic algorithms. The most frequently parallelization method employed to genetic algorithm implements a master-slave model by distributing the most computationally exhausting elements of the algorithm (usually evaluation of the fitness function, i.e. cost functio...
متن کاملParallel Wolff Cluster Algorithms
The Wolff single-cluster algorithm is the most efficient method known for Monte Carlo simulation of many spin models. Due to the irregular size, shape and position of the Wolff clusters, this method does not easily lend itself to efficient parallel implementation, so that simulations using this method have thus far been confined to workstations and vector machines. Here we present two parallel ...
متن کاملParallelization of the AES Algorithm
In this paper we present the parallelization process of the AES algorithm (Rijndael) along with the description of exploited parallelization tools. The data dependences analysis of loops and appropriate loop transformations were applied in order to parallelize the sequential algorithm. The OpenMP standard was chosen for representing the parallelism of the AES algorithm. Speed-up measurements fo...
متن کاملParallelization of the PC Algorithm
This paper describes a parallel version of the PC algorithm for learning the structure of a Bayesian network from data. The PC algorithm is a constraint-based algorithm consisting of five steps where the first step is to perform a set of (conditional) independence tests while the remaining four steps relate to identifying the structure of the Bayesian network using the results of the (condition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2010
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.81.026701